On the cogrowth of Thompson's group F
نویسندگان
چکیده
We investigate the cogrowth and distribution of geodesics in R. Thompson’s group F .
منابع مشابه
ar X iv : m at h / 05 06 34 6 v 1 [ m at h . G R ] 1 7 Ju n 20 05 COMPUTATIONAL EXPLORATIONS IN THOMPSON ’ S GROUP F
Here we describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson's group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symme...
متن کاملCogrowth and Essentiality in Groups and Algebras
The cogrowth of a subgroup is defined as the growth of a set of coset representatives which are of minimal length. A subgroup is essential if it intersects non-trivially every non-trivial subgroup. The main result of this paper is that every function f : N ∪ {0}−→N which is strictly increasing, but at most exponential, is equivalent to a cogrowth function of an essential subgroup of infinite in...
متن کاملThompson's group F is 1-counter graph automatic
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alpha...
متن کاملRandom Sampling of Trivial Words in Finitely Presented Groups
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann distribution π(w) = (|w|+ 1)αβ|w| · Z−1 where |w| is the length of a word w, α and β are parameters of the algorithm, and Z is a normalising constant. It follows ...
متن کاملComputational Explorations in Thompson’s Group F
Here we describe the results of some computational explorations in Thompson’s group F . We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson’s group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Groups Complexity Cryptology
دوره 4 شماره
صفحات -
تاریخ انتشار 2012